Dyck algebras, interval temporal logic and posets of intervals
نویسنده
چکیده
We investigate a natural Heyting algebra structure on the set of Dyck paths of the same length. We provide a geometrical description of the operations of pseudocomplement and relative pseudocomplement, as well as of regular elements. We also find a logic-theoretic interpretation of such Heyting algebras, which we call Dyck algebras, by showing that they are the algebraic counterpart of a certain fragment of a classical interval temporal logic (also known as Halpern-Shoham logic). Finally, we propose a generalization of our approach, suggesting a similar study of the Heyting algebra arising from the poset of intervals of a finite poset using Birkhoff duality. In order to illustrate this, we show how several combinatorial parameters of Dyck paths can be expressed in terms of the Heyting algebra structure of Dyck algebras together with a certain total order on the set of atoms of each Dyck algebra.
منابع مشابه
Two-dimensional Modal Logics of Relational Algebras and Temporal Logics of Intervals
The central idea of the paper is to look at both relation algebras (cf. [JT], [J]) and temporal logic of intervals ([vB1], [V]) from a viewpoint of twodimensional modal logic. Here we mean by a two-dimensional modal logic a system of modal logic in which (at least some of) the intended Kripke semantics is such that the set of possible worlds is (a subset of) a Cartesian product A×A for some set...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملA bijection between intervals in the Fibonacci posets
For each word w in the Fibonacci lattices Fib(r) and Z (r) we partition the interval ^ 0; w] in Fib(r) into subposets called r-Boolean posets. In the case r = 1 those subposets are isomorphic to Boolean algebras. We also partition the interval ^ 0; w] in Z (r) into certain spanning trees of the r-Boolean posets. A bijection between those intervals is given in which each r-Boolean poset in Fib(r...
متن کاملTractable approximations for temporal constraint handling
Relation algebras have been used for various kinds of temporal reasoning. Typically the network satisfaction problem turns out to be NP-hard. For the Allen interval algebra it is often convenient to use the propagation algorithm. This algorithm is sound and runs in cubic time but it is not complete. Here we deene a series of tractable algorithms that provide approximations to solving the networ...
متن کاملCoreflections in Algebraic Quantum Logic∗
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular posets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2016